Negatively Correlated Bandits

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Negatively Correlated Bandits∗

We analyze a two-player game of strategic experimentation with two-armed bandits. Each player has to decide in continuous time whether to use a safe arm with a known payoff or a risky arm whose likelihood of delivering payoffs is initially unknown. The quality of the risky arms is perfectly negatively correlated between players. In marked contrast to the case where both risky arms are of the sa...

متن کامل

Negatively Correlated Echo State Networks

Echo State Network (ESN) is a special type of recurrent neural network with fixed random recurrent part (reservoir) and a trainable reservoir-to-output readout mapping (typically obtained by linear regression). In this work we utilise an ensemble of ESNs with diverse reservoirs whose collective read-out is obtained through Negative Correlation Learning (NCL) of ensemble of Multi-Layer Perceptro...

متن کامل

Simultaneous Learning of Negatively Correlated Neural Networks

A new approach to designing neural network ensembles has been proposed recently 1]. Experimental studies on some regression tasks have shown that the new approach performs signiicantly better than previous ones 1]. This paper presents a new algorithm for designing neural network ensembles for classiication problems with noise. This new algorithm is different from that used for regression tasks ...

متن کامل

Negatively Correlated Neural Networks for Classi cation

A new approach to designing neural network ensembles has been proposed recently 1]. Experimental studies on some regression tasks have shown that the new approach performs signiicantly better than previous ones 1]. However, the regression tasks considered did not include any noise. This paper presents a new algorithm for designing neural network ensembles for classiication problems with noise. ...

متن کامل

Approximation Algorithms for Correlated Knaspacks and Non-Martingale Bandits

In the stochastic knapsack problem, we are given a knapsack of size B, and a set of jobs whose sizes and rewards are drawn from a known probability distribution. However, the only way to know the actual size and reward is to schedule the job—when it completes, we get to know these values. How should we schedule jobs to maximize the expected total reward? We know constant-factor approximations f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Review of Economic Studies

سال: 2011

ISSN: 0034-6527,1467-937X

DOI: 10.1093/restud/rdq025